翻訳と辞書 Words near each other ・ Cyclic pyranopterin monophosphate ・ Cyclic pyranopterin monophosphate synthase ・ Cyclic quadrilateral ・ Cyclic reduction ・ Cyclic redundancy check ・ Cycle basis ・ Cycle button ・ Cycle chic ・ Cycle Collstrop ・ Cycle Computing ・ Cycle count ・ Cycle cover ・ Cycle decomposition ・ Cycle decomposition (graph theory) ・ Cycle detection ・ Cycle double cover ・ Cycle for Declamation ・ Cycle for Survival ・ Cycle Force Group ・ Cycle Friendly Awards ・ Cycle Gear ・ Cycle Glacier ・ Cycle graph ・ Cycle graph (algebra) ・ Cycle index ・ Cycle Messenger World Championships ・ Cycle News ・ Cycle of abuse ・ Cycle of erosion ・ Cycle of Eternity Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Cycle double cover ： ウィキペディア英語版 Cycle double cover In graph-theoretic mathematics, a cycle double cover is a collection of cycles in an undirected graph that together include each edge of the graph exactly twice. For instance, for any polyhedral graph, the faces of a convex polyhedron that represents the graph provide a double cover of the graph: each edge belongs to exactly two faces. It is an unsolved problem, posed by George Szekeres〔.〕 and Paul Seymour〔.〕 and known as the cycle double cover conjecture, whether every bridgeless graph has a cycle double cover. The conjecture can equivalently be formulated in terms of graph embeddings, and in that context is also known as the circular embedding conjecture. ==Formulation== The usual formulation of the cycle double cover conjecture asks whether every bridgeless undirected graph has a collection of cycles such that each edge of the graph is contained in exactly two of the cycles. The requirement that the graph be bridgeless is an obvious necessary condition for such a set of cycles to exist, because a bridge cannot belong to any cycle. A collection of cycles satisfying the condition of the cycle double cover conjecture is called a cycle double cover. Some graphs such as cycle graphs and bridgeless cactus graphs can only be covered by using the same cycle more than once, so this sort of duplication is allowed in a cycle double cover. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Cycle double cover」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.